IndeCut evaluates performance of network motif discovery algorithms
نویسندگان
چکیده
منابع مشابه
IndeCut evaluates performance of network motif discovery algorithms.
Motivation Genomic networks represent a complex map of molecular interactions which are descriptive of the biological processes occurring in living cells. Identifying the small over-represented circuitry patterns in these networks helps generate hypotheses about the functional basis of such complex processes. Network motif discovery is a systematic way of achieving this goal. However, a reliabl...
متن کاملPerformance evaluation of DNA Motif discovery programs
Methods for the identification of transcription factor binding sites have proved to be useful for deciphering genetic regulatory networks. The strengths and weaknesses for a number of available web tools are not fully understood. Here, we designed a comprehensive set of performance measures and benchmarked sequence-based motif discovery tools using large scale datasets (derived from Escherichia...
متن کاملPerformance Analysis of Network Assisted Neighbor Discovery Algorithms
Recently there has been an increasing interest in applications that enable users in the proximity of one another to share experiences, discover surrounding events, play online games and in general develop proximity based social networks. Most of the existing applications are based on cellular network communications, combined with over-the-top (OTT) solutions involving either registration at an ...
متن کاملDiscovering larger network motifs: Network clustering for Network Motif discovery
We want to discover larger network motifs, with more than 15 number of nodes. In order to propose an algorithm for finding larger network motifs in any biological network, we review some of models and algorithms to find network motifs. There are two types of methods, one is exact counting and the other is approximate sampling. Generalization of random graphs is another important issue to evalua...
متن کاملLimitations and potentials of current motif discovery algorithms
Computational methods for de novo identification of gene regulation elements, such as transcription factor binding sites, have proved to be useful for deciphering genetic regulatory networks. However, despite the availability of a large number of algorithms, their strengths and weaknesses are not sufficiently understood. Here, we designed a comprehensive set of performance measures and benchmar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2017
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btx798